A Semantic Approach to Order-sorted Rewriting
نویسندگان
چکیده
منابع مشابه
Currying of Order-Sorted Term Rewriting Systems
Term rewriting system is a helpful tool for implementing functional programming languages. We focus upon a transformation of term rewriting systems called currying. Currying transforms a term rewriting system with symbols of arbitrary arity into another one, which contains only nullary symbols with a single binary symbol called application. Currying in single-sorted case is explored in [1] but ...
متن کاملOrder-Sorted Rewriting and Congruence Closure
Order-sorted type systems supporting inheritance hierarchies and subtype polymorphism are used in theorem proving, AI, and declarative programming. The satisfiability problems for the theories of: (i) order-sorted uninterpreted function symbols, and (ii) of such symbols modulo a subset Δ of associative-commutative ones are reduced to the unsorted versions of such problems at no extra computatio...
متن کاملa frame semantic approach to the study of translating cultural scripts in salingers franny and zooey
the frame semantic theory is a nascent approach in the area of translation studies which goes beyond the linguistic barriers and helps us to incorporate cognitive and cultural factors to the study of translation. based on rojos analytical model (2002b), which centered in the frames or knowledge structures activated in the text, the present research explores the various translation problems that...
15 صفحه اولFree Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors
We introduce the notions of sequentiality and strong sequentiality in order-sorted rewriting systems, both closely related to the subsort order and to the form of declarations of the signature. We deene free sequentiality for the class of orthogonal systems with constructors, a notion which does not impose conditions over the signature. We provide an eeective decision procedure for free sequent...
متن کاملA Semantic Approach to Query Rewriting for Integrated XML Data
Query rewriting is a fundamental task in query optimization and data integration. With the advent of the web, there has been renewed interest in data integration, where data is dispersed among many sources and an integrated view over these sources is provided. Queries on the integrated view are rewritten to query the underlying source repositories. In this paper, we develop a novel algorithm fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1998
ISSN: 0747-7171
DOI: 10.1006/jsco.1997.0188